"Pretty Strong" Converse for the Quantum Capacity of Degradable Channels

نویسندگان

  • Ciara Morgan
  • Andreas J. Winter
چکیده

We exhibit a possible road towards a strong converse for the quantum capacity of degradable channels. In particular, we show that all degradable channels obey what we call a “pretty strong” converse: When the code rate increases above the quantum capacity, the fidelity makes a discontinuous jump from 1 to at most 1 √ 2 , asymptotically. A similar result can be shown for the private (classical) capacity. Furthermore, we prove that if the strong converse holds for symmetric channels (which have quantum capacity zero), then degradable channels obey the strong converse: The above-mentioned asymptotic jump of the fidelity at the quantum capacity is then from 1 down to 0.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

"Pretty strong" converse for the private capacity of degraded quantum wiretap channels

In the vein of the recent “pretty strong” converse for the quantum and private capacity of degradable quantum channels [Morgan/Winter, IEEE Trans. Inf. Theory 60(1):317333, 2014], we use the same techniques, in particular the calculus of min-entropies, to show a pretty strong converse for the private capacity of degraded classical-quantum-quantum (cqq-)wiretap channels, which generalize Wyner’s...

متن کامل

Strong Converse for the Quantum Capacity of the Erasure Channel for Almost All Codes

A strong converse theorem for channel capacity establishes that the error probability in any communication scheme for a given channel necessarily tends to one if the rate of communication exceeds the channel’s capacity. Establishing such a theorem for the quantum capacity of degradable channels has been an elusive task, with the strongest progress so far being a so-called “pretty strong convers...

متن کامل

Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy

A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of communication exceeds the classical capacity of the channel. Along with a corresponding achievability statement for rates below the capacity, such a strong converse th...

متن کامل

On converse bounds for classical communication over quantum channels

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regime. First, we show that the MatthewsWehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new efficiently comp...

متن کامل

Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels

We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the ent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2014